QRT: A QR-Based Tridiagonalization Algorithm for Nonsymmetric Matrices
نویسندگان
چکیده
منابع مشابه
QRT: A QR-Based Tridiagonalization Algorithm for Nonsymmetric Matrices
A QR-based tridiagonal-ization algorithm for nonsymmetric matrices. SIAM J. Mat.
متن کاملA Fast QR Algorithm for Companion Matrices
It has been shown in [4, 5, 6, 31] that the Hessenberg iterates of a companion matrix under the QR iterations have low off-diagonal rank structures. Such invariant rank structures were exploited therein to design fast QR iteration algorithms for finding eigenvalues of companion matrices. These algorithms require only O(n) storage and run in O(n) time where n is the dimension of the matrix. In t...
متن کاملA Distributed Memory Implementation of the Nonsymmetric QR Algorithm
The QR algorithm is the crux of the serial nonsymmetric eigenvalue problem. Recent eeorts to parallelize this algorithm have made signiicant advances towards solving the parallel nonsym-metric eigenvalue problem. Most methods to date suuer a scalability problem. In this talk we discuss an approach for parallelizing QR which overcomes many of the disadvantages to date. We also give insights into...
متن کاملA fast implicit QR eigenvalue algorithm for companion matrices
Article history: Received 5 November 2008 Accepted 3 August 2009 Available online 4 September 2009 Submitted by V. Olshevsky AMS classification: 65F15 65H17
متن کاملTridiagonalization of Completely Nonnegative Matrices
Let M = [ttUiSi /_i be completely nonnegative (CNN), i.e., every minor of Mis nonnegative. Two methods for reducing the eigenvalue problem for M to that of a CNN, tridiagonal matrix, T = [?,-,] (r,-,= 0 when |i — j\ > 1), are presented in this paper. In the particular case that M is nonsingular it is shown for one of the methods that there exists a CNN nonsingular 5 such that SM = TS.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 2005
ISSN: 0895-4798,1095-7162
DOI: 10.1137/040612476